The Talking Points Tool: A Brief Intervention to Support Predoctoral Student and Faculty Advisor Communication

Excellent relationships between predoctoral students and faculty supervisors can lay the foundation for a satisfying degree program and productive future. Contrarily, poor relationships can frustrate both students and supervisors. We examined mentoring experiences focused on career development. Students desired enhanced career mentoring but were uncomfortable approaching their supervisors with these concerns. Faculty advisors reported willingness to support students’ career development, yet expected students to initiate those conversations. Responding to this communication disconnect, we developed a brief intervention to facilitate conversations—a Talking Points Tool (TPT). In this paper, we examine whether the TPT influenced students’ career conversations and development.Cockrell School of Engineerin

On the Complexity of Temporal-Logic Path Checking

Given a formula in a temporal logic such as LTL or MTL, a fundamental problem is the complexity of evaluating the formula on a given finite word. For LTL, the complexity of this task was recently shown to be in NC. In this paper, we present an NC algorithm for MTL, a quantitative (or metric) extension of LTL, and give an NCC algorithm for UTL, the unary fragment of LTL. At the time of writing, MTL is the most expressive logic with an NC path-checking algorithm, and UTL is the most expressive fragment of LTL with a more efficient path-checking algorithm than for full LTL (subject to standard complexity-theoretic assumptions). We then establish a connection between LTL path checking and planar circuits, which we exploit to show that any further progress in determining the precise complexity of LTL path checking would immediately entail more efficient evaluation algorithms than are known for a certain class of planar circuits. The connection further implies that the complexity of LTL path checking depends on the Boolean connectives allowed: adding Boolean exclusive or yields a temporal logic with P-complete path-checking problem

Motor Learning Deficits in Parkinson\u27s Disease (PD) and Their Effect on Training Response in Gait and Balance: A Narrative Review

Parkinson\u27s disease (PD) is a neurological disorder traditionally associated with degeneration of the dopaminergic neurons within the substantia nigra, which results in bradykinesia, rigidity, tremor, and postural instability and gait disability (PIGD). The disorder has also been implicated in degradation of motor learning. While individuals with PD are able to learn, certain aspects of learning, especially automatic responses to feedback, are faulty, resulting in a reliance on feedforward systems of movement learning and control. Because of this, patients with PD may require more training to achieve and retain motor learning and may require additional sensory information or motor guidance in order to facilitate this learning. Furthermore, they may be unable to maintain these gains in environments and situations in which conscious effort is divided (such as dual-tasking). These shortcomings in motor learning could play a large part in degenerative gait and balance symptoms often seen in the disease, as patients are unable to adapt to gradual sensory and motor degradation. Research has shown that physical and exercise therapy can help patients with PD to adapt new feedforward strategies to partially counteract these symptoms. In particular, balance, treadmill, resistance, and repeated perturbation training therapies have been shown to improve motor patterns in PD. However, much research is still needed to determine which of these therapies best alleviates which symptoms of PIGD, the needed dose and intensity of these therapies, and long-term retention effects. The benefits of such technologies as augmented feedback, motorized perturbations, virtual reality, and weight-bearing assistance are also of interest. This narrative review will evaluate the effect of PD on motor learning and the effect of motor learning deficits on response to physical therapy and training programs, focusing specifically on features related to PIGD. Potential methods to strengthen therapeutic effects will be discussed

Interestingness of traces in declarative process mining: The janus LTLPf Approach

Declarative process mining is the set of techniques aimed at extracting behavioural constraints from event logs. These constraints are inherently of a reactive nature, in that their activation restricts the occurrence of other activities. In this way, they are prone to the principle of ex falso quod libet: they can be satisfied even when not activated. As a consequence, constraints can be mined that are hardly interesting to users or even potentially misleading. In this paper, we build on the observation that users typically read and write temporal constraints as if-statements with an explicit indication of the activation condition. Our approach is called Janus, because it permits the specification and verification of reactive constraints that, upon activation, look forward into the future and backwards into the past of a trace. Reactive constraints are expressed using Linear-time Temporal Logic with Past on Finite Traces (LTLp f). To mine them out of event logs, we devise a time bi-directional valuation technique based on triplets of automata operating in an on-line fashion. Our solution proves efficient, being at most quadratic w.r.t. trace length, and effective in recognising interestingness of discovered constraints

Nicotine Bitartrate Reduces Falls and Freezing of Gait in Parkinson Disease: A Reanalysis

Objective: Determine if NC001, an oral formulation of nicotine that reduces levodopa-induced dyskinesias (LIDs) in MPTP-Parkinson monkeys, could reduce falls, freezing of gait (FOG), and LIDs in Parkinson disease (PD) patients. Methods: Previously collected data from a study analyzing the effects of NC001 on LIDs in PD patients were reanalyzed. Because indirect-acting cholinergic drugs are sometimes helpful in reducing falls, we hypothesized that NC001, a direct-acting cholinergic agonist, could reduce falls in PD. The original 12-center, double-blind, randomized trial enrolled 65 PD patients. NC001 or placebo was administered 4 times per day for 10 weeks, beginning at 4 mg/day and escalating to 24 mg/day. Assessments included the Unified Dyskinesia Rating Scale (UDysRS) and Parts II-III of the original Unified Parkinson\u27s Disease Rating Scale (UPDRS). Results: Randomization (1:1) resulted in 35 patients on NC001 and 30 on placebo at baseline. Thirty and 27 patients, respectively, had data available for an intent-to-treat analysis. NC001 was safe and well-tolerated. After 10 weeks, NC001 patients (14/30) had a significant reduction in falls vs. placebo patients (3/27) (p = 0.0041) as assessed by UPDRS Part II. NC001 patients (12/30) also had significantly reduced FOG vs. placebo patients (4/27) (p = 0.0043). NC001 patients, compared with placebo patients, had a significant improvement (p = 0.01) in UDysRS ambulation subtest (40% vs. 3%, respectively). Although NC001 patients had a greater reduction in dyskinesias on the UDysRS than placebo patients (30% vs. 19%, respectively), this was not significant (p = 0.09). Conclusions: NC001 significantly improved two refractory symptoms of PD, falls and FOG. The reduction in falls and FOG is attributed to selective stimulation of nicotinic receptors

A Natural Framework for Solar and 17 keV Neutrinos

Motivated by recent experimental claims for the existence of a 17 keV neutrino and by the solar neutrino problem, we construct a class of models which contain in their low-energy spectrum a single light sterile neutrino and one or more Nambu-Goldstone bosons. In these models the required pattern of breaking of lepton-number symmetry takes place near the electroweak scale and all mass heirarchies are technically natural. The models are compatible with all cosmological and astrophysical constraints, and can solve the solar neutrino problem via either the MSW effect or vacuum oscillations. The deficit in atmospheric muon neutrinos seen in the Kamiokande and IMB detectors can also be explained in these models.Comment: 23 page

Compressed Membership for NFA (DFA) with Compressed Labels is in NP (P)

In this paper, a compressed membership problem for finite automata, both deterministic and non-deterministic, with compressed transition labels is studied. The compression is represented by straight-line programs (SLPs), i.e. context-free grammars generating exactly one string. A novel technique of dealing with SLPs is introduced: the SLPs are recompressed, so that substrings of the input text are encoded in SLPs labelling the transitions of the NFA (DFA) in the same way, as in the SLP representing the input text. To this end, the SLPs are locally decompressed and then recompressed in a uniform way. Furthermore, such recompression induces only small changes in the automaton, in particular, the size of the automaton remains polynomial. Using this technique it is shown that the compressed membership for NFA with compressed labels is in NP, thus confirming the conjecture of Plandowski and Rytter and extending the partial result of Lohrey and Mathissen; as it is already known, that this problem is NP-hard, we settle its exact computational complexity. Moreover, the same technique applied to the compressed membership for DFA with compressed labels yields that this problem is in P; for this problem, only trivial upper-bound PSPACE was known

The complexity of clausal fragments of LTL

We introduce and investigate a number of fragments of propositional temporal logic LTL over the flow of time (ℤ, <). The fragments are defined in terms of the available temporal operators and the structure of the clausal normal form of the temporal formulas. We determine the computational complexity of the satisfiability problem for each of the fragments, which ranges from NLogSpace to PTime, NP and PSpace

Model Checking CTL is Almost Always Inherently Sequential

The model checking problem for CTL is known to be P-complete (Clarke, Emerson, and Sistla (1986), see Schnoebelen (2002)). We consider fragments of CTL obtained by restricting the use of temporal modalities or the use of negations---restrictions already studied for LTL by Sistla and Clarke (1985) and Markey (2004). For all these fragments, except for the trivial case without any temporal operator, we systematically prove model checking to be either inherently sequential (P-complete) or very efficiently parallelizable (LOGCFL-complete). For most fragments, however, model checking for CTL is already P-complete. Hence our results indicate that, in cases where the combined complexity is of relevance, approaching CTL model checking by parallelism cannot be expected to result in any significant speedup. We also completely determine the complexity of the model checking problem for all fragments of the extensions ECTL, CTL+, and ECTL+